Finding Hamiltonian Cycle in Polynomial Time
نویسندگان
چکیده
منابع مشابه
Experimental Results on Hamiltonian-Cycle-Finding Algorithms
Frieze [1] introduced a heuristic polynomial-time algorithm, Ham, for finding Hamiltonian cycles in random graphs with high probability. We wanted to see how this algorithm performs in practice, and whether it could be improved by modifying it. For this purpose, we borrowed an idea from an algorithm by Keydar called SemiHam [2]. SemiHam is a modification of Ham that finds Hamiltonian cycles in ...
متن کاملFinding Relations in Polynomial Time
Given a set of m observations on n variables, an 0(mn) algorithm is proposed to find a basis of all affine relations between these variables satisfied by the observations. On a 25 variables example, this new algorithm is 130 000 times faster than the "all subsets" option for linear regression of the SAS package which is a non polynomial alternative. Extension to the cases where squares, ratios,...
متن کاملThe Complexity of Hamiltonian Cycle Problem in Digraps with Degree Bound Two is Polynomial Time
The incidence matrix of Cnm of a simple digraph is mapped into a incidence matrix F of a balanced bipartite undirected graph by divided C into two groups. Based on the mapping, it proves that the complexity is polynomial to determin a Hamiltonian cycle existence or not in a simple digraph with degree bound two and obtain all solution if it exists Hamiltonian cycle. It also proves P = NP with th...
متن کاملFinding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation
The notion of treewidth, introduced by Robertson and Seymour in their seminal Graph Minors series, turned out to have tremendous impact on graph algorithmics. Many hard computational problems on graphs turn out to be efficiently solvable in graphs of bounded treewidth: graphs that can be sweeped with separators of bounded size. These efficient algorithms usually follow the dynamic programming p...
متن کاملFinding Sylow Normalizers in Polynomial Time
Given a set r of permutations of an n-set, let G be the group of permutations generated by r. I f p is any prime, it is known that a Sylow p-subgroup P of G can be found in polynomial time. We show that the normalizer of P can also be found in polynomial time. In particular, given two Sylow p-subgroups of G, all elements conjugating one to the other can be found (as a coset of the normalizer of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2006
ISSN: 1812-5638
DOI: 10.3923/itj.2006.851.859